A greedy algorithm for supervised discretization
نویسندگان
چکیده
منابع مشابه
A greedy algorithm for supervised discretization
We present a greedy algorithm for supervised discretization using a metric defined on the space of partitions of a set of objects. This proposed technique is useful for preparing the data for classifiers that require nominal attributes. Experimental work on decision trees and naïve Bayes classifiers confirm the efficacy of the proposed algorithm.
متن کاملA Bayesian approach for supervised discretization
In supervised machine learning, some algorithms are restricted to discrete data and thus need to discretize continuous attributes. In this paper, we present a new discretization method called MODL, based on a Bayesian approach. The MODL method relies on a model space of discretizations and on a prior distribution defined on this model space. This allows the setting up of an evaluation criterion...
متن کاملConvergence rate of the semi-supervised greedy algorithm
This paper proposes a new greedy algorithm combining the semi-supervised learning and the sparse representation with the data-dependent hypothesis spaces. The proposed greedy algorithm is able to use a small portion of the labeled and unlabeled data to represent the target function, and to efficiently reduce the computational burden of the semi-supervised learning. We establish the estimation o...
متن کاملSupervised Discretization for Rough Sets – a Neighborhood Graph Approach
Rough set theory has become an important mathematical tool for dealing with uncertainty in data. The data discretization is one of the main problems to be solved in the process of synthesis of decision rules from table-organized data. In this paper, we present a new discretization method in the context of supervised training. This method is based on the neighborhood graph. To evaluate supervise...
متن کاملA Supervised Discretization Method for Quantitative and Qualitative Ordered Variables
In this work, a new technique to define cut-points in the discretization process of a continuous attribute is presented. This method is used as a prior step in a regression problem, considered as a learning problem in which the output variable can be either quantitative (continuous or discreet) or qualitative defined over an ordinal scale. The proposed method emphasizes the concept of location ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Biomedical Informatics
سال: 2004
ISSN: 1532-0464
DOI: 10.1016/j.jbi.2004.07.006